Performance analysis of coarray-based MUSIC and the Cramér-Rao bound
نویسندگان
چکیده
Sparse linear arrays, such as co-prime and nested arrays, can identify up to O(M) sources with only O(M) sensors by using co-array based MUSIC. We conduct analytical performance analysis of two coarray based MUSIC algorithms, namely the direct augmentation based MUSIC, and the spatial smoothing based MUSIC. In addition, we analyze the Cramér-Rao bound for sparse linear arrays, and show that for co-prime and nested arrays, it can decrease at a rate of O(M−5) as the number of sensors M goes to infinity, in contrast to O(M−3) in the ULA case. We use numerical examples to demonstrate our analytical results.
منابع مشابه
Coarrays, MUSIC, and the Cramér-Rao Bound
Sparse linear arrays, such as co-prime arrays and nested arrays, have the attractive capability of providing enhanced degrees of freedom. By exploiting the coarray structure, an augmented sample covariance matrix can be constructed and MUSIC (MUtiple SIgnal Classification) can be applied to identify more sources than the number of sensors. While such a MUSIC algorithm works quite well, its perf...
متن کامل2-d Sensor Position Perturbation Analysis: Equivalence to Awgn on Array Outputs
In this paper, the performance of a subspace beamformer, namely the multiple signal classification algorithm (MUSIC), is scrutinized in the presence of sensor position errors. Based on a perturbation model, a relationship between the array autocorrelation matrix and the source autocorrelation matrix is established. It is shown that under certain assumptions on the source signals, the Gaussian s...
متن کاملNew Cramér-Rao bound expressions for coprime and other sparse arrays
The Cramér-Rao bound (CRB) offers a lower bound on the variances of unbiased estimates of parameters, e.g., directions of arrival (DOA) in array processing. While there exist landmark papers on the study of the CRB in the context of array processing, the closed-form expressions available in the literature are not easy to use in the context of sparse arrays (such as minimum redundancy arrays (MR...
متن کاملA Novel Noncircular MUSIC Algorithm Based on the Concept of the Difference and Sum Coarray
In this paper, we propose a vectorized noncircular MUSIC (VNCM) algorithm based on the concept of the coarray, which can construct the difference and sum (diff-sum) coarray, for direction finding of the noncircular (NC) quasi-stationary sources. Utilizing both the NC property and the concept of the Khatri-Rao product, the proposed method can be applied to not only the ULA but also sparse arrays...
متن کاملAutonomous Positioning Techniques Based on Cramér-Rao Lower Bound Analysis
We consider the problem of autonomously locating a number of asynchronous sensor nodes in a wireless network. A strong focus lies on reducing the processing resources needed to solve the relative positioning problem, an issue of great interest in resourceconstrained wireless sensor networks. In the first part of the paper, based on a well-known derivation of the Cramér-Rao lower bound for the a...
متن کامل